Robust Generalized Total Least Squares Iterative Closest Point Registration
نویسندگان
چکیده
This paper investigates the use of a total least squares approach in a generalization of the iterative closest point (ICP) algorithm for shape registration. A new Generalized Total Least Squares (GTLS) formulation of the minimization process is presented opposed to the traditional Least Squares (LS) technique. Accounting for uncertainty both in the target and in the source models will lead to a more robust estimation of the transformation. Robustness against outliers is guaranteed by an iterative scheme to update the noise covariances. Experimental results show that this generalization is superior to the least squares counterpart.
منابع مشابه
Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment
We present a probabilistic registration algorithm that robustly solves the problem of rigid-body alignment between two shapes with high accuracy, by aptly modeling measurement noise in each shape, whether isotropic or anisotropic. For point-cloud shapes, the probabilistic framework additionally enables modeling locally-linear surface regions in the vicinity of each point to further improve regi...
متن کاملSpotlights: A Robust Method for Surface-Based Registration in Orthopedic Surgery
Fast, simple and effective registration methods are needed in a wide variety of computer-assisted surgical procedures in which readily locatable anatomical landmarks are not available. Orthopedic procedures about the knee, in particular, are adversely affected if the registration accuracy exceeds about 1 mm in translation or about in rotation, and the proximal tibia and distal femur are typical...
متن کاملRobust registration for computer-integrated orthopedic surgery: Laboratory validation and clinical experience
In order to provide navigational guidance during computer-integrated orthopedic surgery, the anatomy of the patient must first be registered to a medical image or model. A common registration approach is to digitize points from the surface of a bone and then find the rigid transformation that best matches the points to the model by constrained optimization. Many optimization criteria, including...
متن کامل4D Shape Registration for Dynamic Electrophysiological Cardiac Mapping
Registration of 3D segmented cardiac images with tracked electrophysiological data has been previously investigated for use in cardiac mapping and navigation systems. However, dynamic cardiac 4D (3D + time) registration methods do not presently exist. This paper introduces two new 4D registration methods based on the popular iterative closest point (ICP) algorithm that may be applied to dynamic...
متن کاملParallel Evolutionary Registration of Range Data
Most range data registration techniques are variants on the iterative closest point (ICP) algorithm, proposed by Chen and Medioni [2] and Besl and McKay [3]. That algorithm, though, is only one approach to optimizing a least-squares point correspondence sum proposed by Arun et al [1]. In its basic form ICP has many problems for example, its reliance on pre-registration by hand close to the glob...
متن کامل